Decentralized Rendezvous of Nonholonomic Robots With Sensing and Connectivity Constraints

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decentralized Rendezvous of Nonholonomic Robots with Sensing and Connectivity Constraints

A group of wheeled robots with nonholonomic constraints is considered to rendezvous at a common specified setpoint with a desired orientation while maintaining network connectivity and ensuring collision avoidance within the robots. Given communication and sensing constraints for each robot, only a subset of the robots are aware or informed of the global destination, and the remaining robots mu...

متن کامل

Decentralized Connectivity Preserving Formation Control with Collision Avoidance for Nonholonomic Wheeled Mobile Robots

The preservation of connectivity in mobile robot networks is critical to the success of most existing algorithms designed to achieve various goals. The most basic method to achieve this involves each agent preserving its edges for all time. More advanced methods preserve a (minimum) spanning tree in the network. Other methods are based on increasing the algebraic graph connectivity, which is gi...

متن کامل

Real-Time Optimized Rendezvous on Nonholonomic Resource-Constrained Robots

In this work, we consider a group of differential-wheeled robots endowed with noisy relative positioning capabilities. We develop a decentralized approach based on a receding horizon controller to generate, in real-time, trajectories that guarantee the convergence of our robots to a common location (i.e. rendezvous). Our receding horizon controller is tailored around two numerical optimization ...

متن کامل

Decentralized motion planning for cooperative nonholonomic mobile robots ⋆

This paper presents a decentralized motion planner for a formation of autonomous mobile robots evolving in an unknown environment with obstacles. The motion planning scheme consists of decentralized receding horizon planners that reside on each vehicle to achieve coordination among formation agents. The advantage of the proposed algorithm is that each vehicle only requires local knowledge of it...

متن کامل

Decentralized motion planning for multiple robots subject to sensing and communication constraints

We address the problem of planning the motion of a team of mobile robots subject to constraints imposed by sensors and the communication network. Our goal is to develop a decentralized motion control system that leads each robot to their individual goals while keeping connectivity with the neighbors. We present experimental results with a group of car-like robots equipped with omnidirectional v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Dynamic Systems, Measurement, and Control

سال: 2016

ISSN: 0022-0434,1528-9028

DOI: 10.1115/1.4034745